package com.cheung.leetcode.contest.week.week406;

import  org.junit.jupiter.api.Test;

/**
 * @BelongsProject : java-leetcode
 * @BelongsPackage : com.cheung.leetcode.contest.week406
 * @Author :  cheungming
 * @CreateTime : 2024-07-14 11:08:48
 * @Description : 竞赛100361
 * @Version : 1.0
 */
public class Code100361Test {

    public int minimumCost(int m, int n, int[] horizontalCut, int[] verticalCut) {

        return 0;
    }

    @Test
    public void test1() {
        int m = 3, n = 2;
        int[] horizontalCut = {1, 3};
        int[] verticalCut = {5};
        assert minimumCost(m, n, horizontalCut, verticalCut) == 13;
    }

}
